Load Balancing by Domain Decomposition: the Bounded Neighbours Approach

This paper presents a new domain decomposition approach whose main goal is the computation of a load balancing partition while reducing the overhead to compute such a partition. In the proposed approach, the number of neighbours of each sub-domain produced by the decomposition can be bounded by an user supplied value. This reduces the communication overhead of the application. We describe an algorithm implementing our decomposition strategy and apply our approach to WaTOR, a classical dynamical simulation problem. We report also some preliminaries result to prove the effectiveness of our approach.